Lenin’s Memorization as a Hierotopic Project

A Formal Specification of the Memorization Process

In this chapter we present the formal language, stochastic process algebra (STOPA), to specify cognitive systems. In addition to the usual characteristics of these formalisms, this language features the possibility of including stochastic time. This kind of time is useful to represent systems where the delays are not controlled by fixed amounts of time, but are given by probability distribution...

Memorization and Information-Retrieval Behaviors

What is the relationship between memorization of information and the behavior used to retrieve that information? Searching for photos stored on a media is a common activity. Chances are that it is easier to find some types of photos than others. To determine the reason for this, we conducted a user study to clarify the mechanisms people use to retrieve information. We found that the operational...

Memorization Learning for Object Recognition

We consider the fundamental complexity of intelligent systems, and argue that some form of learning is essential in order to acquire the amount of information necessary to specify such a system. In this view, learning is essentially a means of acquiring large amounts of structured information by relatively simple recoding of information owing down high-bandwidth channels (the senses) from a pre...

Planning as a Heterosexist Project

Refined memorization for vertex cover

Memorization is a technique which allows to speed up exponential recursive algorithms at the cost of an exponential space complexity. This technique already leads to the currently fastest algorithm for fixed-parameter vertex cover, whose time complexity is O(1.2832kk1.5 + kn), where n is the number of nodes and k is the size of the vertex cover. Via a refined use of memorization, we obtain a O(...